2 00 6 Products of Foldable Triangulations
نویسندگان
چکیده
Regular triangulations of products of lattice polytopes are constructed with the additional property that the dual graphs of the triangulations are bipartite. The (weighted) size difference of this bipartition is a lower bound for the number of real roots of certain sparse polynomial systems by recent results of Soprunova and Sottile [Adv. Math. 204(1):116–151, 2006]. Special attention is paid to the cube case.
منابع مشابه
A ug 2 00 5 BALANCED TRIANGULATIONS OF LATTICE POLYTOPES
Regular triangulations of products of lattice polytopes are constructed with the additional property that the dual graphs of the triangulations are bipartite. Special attention is paid to the cube case. Such triangulations are instrumental in deriving lower bunds for the number of real roots of certain sparse polynomial systems by recent results of Soprunova and Sottile [21].
متن کاملDiagonal flips in outer-Klein-bottle triangulations
We determine the complete list of the irreducible outer-Klein-bottle triangulations, and we prove that any two outer-Klein-bottle triangulations with the same number of vertices can be transformed into each other by a sequence of diagonal ips, up to homeomorphism. c © 2000 Elsevier Science B.V. All rights reserved.
متن کامل2 00 6 Pseudo - Triangulations — a Survey
A pseudo-triangle is a simple polygon with three convex vertices, and a pseudo-triangulation is a tiling of a planar region into pseudo-triangles. Pseudo-triangulations appear as data structures in computational geometry, as planar bar-and-joint frameworks in rigidity theory and as projections of locally convex surfaces. This survey of current literature includes combinatorial properties and co...
متن کاملN ov 2 00 6 ENUMERATIVE PROPERTIES OF TRIANGULATIONS OF SPHERICAL BUNDLES OVER S 1
We give a complete characterization of all possible pairs (f 0 , f 1), where f 0 is the number of vertices and f 1 is the number of edges, of any sim-plicial triangulation of an S k-bundle over S 1. The main point is that Kühnel's triangulations of S 2k+1 × S 1 and the nonorientable S 2k-bundle over S 1 are unique among all triangulations of (n − 1)-dimensional homology manifolds with first Bet...
متن کاملAn efficient implementation of Delaunay triangulations in medium dimensions
We propose a new C++ implementation of the well-known incremental algorithm for the construction of Delaunay triangulations in any dimension. Our implementation follows the exact computing paradigm and is fully robust. Extensive comparisons have shown that our implementation outperforms the best currently available codes for convex hulls and Delaunay triangulations, and that it can be used for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006